\hypertarget{priority__queue_8h}{
\section{src/priority\_\-queue.h File Reference}
\label{priority__queue_8h}\index{src/priority\_\-queue.h@{src/priority\_\-queue.h}}
}


Different implementation of priority queue than std::priority\_\-queue. This queue contains an array of queues, instead of applying sorting algorithms.  


{\ttfamily \#include $<$queue$>$}\par
\subsection*{Classes}
\begin{DoxyCompactItemize}
\item 
class \hyperlink{class_priority_queue}{PriorityQueue$<$ T $>$}
\end{DoxyCompactItemize}
\subsection*{Typedefs}
\begin{DoxyCompactItemize}
\item 
typedef \hyperlink{class_priority_queue}{PriorityQueue}$<$ int $>$ \hyperlink{priority__queue_8h_adc08538984872618bc942097e5912199}{IntPriQueue}
\end{DoxyCompactItemize}


\subsection{Detailed Description}
Different implementation of priority queue than std::priority\_\-queue. This queue contains an array of queues, instead of applying sorting algorithms. 

\subsection{Typedef Documentation}
\hypertarget{priority__queue_8h_adc08538984872618bc942097e5912199}{
\index{priority\_\-queue.h@{priority\_\-queue.h}!IntPriQueue@{IntPriQueue}}
\index{IntPriQueue@{IntPriQueue}!priority_queue.h@{priority\_\-queue.h}}
\subsubsection[{IntPriQueue}]{\setlength{\rightskip}{0pt plus 5cm}typedef {\bf PriorityQueue}$<$int$>$ {\bf IntPriQueue}}}
\label{priority__queue_8h_adc08538984872618bc942097e5912199}
